Intractability of Optimal Multirobot Path Planning on Planar Graphs
نویسندگان
چکیده
منابع مشابه
Structure and Intractability of Optimal Multi-Robot Path Planning on Graphs
In this paper, we study the structure and computational complexity of optimal multi-robot path planning problems on graphs. Our results encompass three formulations of the discrete multi-robot path planning problem, including a variant that allows synchronous rotations of robots along fully occupied, disjoint cycles on the graph. Allowing rotation of robots provides a more natural model for mul...
متن کاملOptimal Parallel Algorithms for Path Problems on Planar Graphs
Given a biconnected planar graph G and a pair of vertices s and t, the two disjoint problem asks to find a pair of internally disjoint paths from s to t. We present a simple and efficient parallel algorithm for the same. Our algorithm uses the notion of bridges in a novel way and this results in a more elegant and simple algorithm than the existing one. The all-bidirectionaledges (ABE) problem ...
متن کاملSubdimensional expansion for multirobot path planning
Planning optimal paths for large numbers of robots is computationally expensive. In this paper, we introduce a new framework for multirobot path planning called subdimensional expansion, which initially plans for each robot individually, and then coordinates motion among the robots as needed. More specifically, subdimensional expansion initially creates a one-dimensional search space embedded i...
متن کاملTime Optimal Multi-Agent Path Planning on Graphs
Significant progress has been made in the area of multiagent path finding/planning in the past decade (Silver 2005; van den Berg et al. 2009; Standley 2010; Luna and Bekris 2011; Wang and Botea 2011). In this work, we introduce a multi-agent path planning problem similar to that of (Standley 2010) and aim at maximizing parallelism among the agents. That is, we seek a feasible plan that minimize...
متن کاملOn the Path-Width of Planar Graphs
In this paper, we present a result concerning the relation between the path-with of a planar graph and the path-width of its dual. More precisely, we prove that for a 3-connected planar graph G, pw(G) ≤ 3pw(G∗) + 2. For 4-connected planar graphs, and more generally for Hamiltonian planar graphs, we prove a stronger bound pw(G∗) ≤ 2 pw(G) + c. The best previously known bound was obtained by Fomi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Robotics and Automation Letters
سال: 2016
ISSN: 2377-3766,2377-3774
DOI: 10.1109/lra.2015.2503143